Ela Indefinite Copositive Matrices with Exactly One Positive Eigenvalue or Exactly One Negative Eigenvalue

نویسنده

  • BOLOR JARGALSAIKHAN
چکیده

Checking copositivity of a matrix is a co-NP-complete problem. This paper studies copositive matrices with certain spectral properties. It shows that an indefinite matrix with exactly one positive eigenvalue is copositive if and only if the matrix is nonnegative. Moreover, it shows that finding out if a matrix with exactly one negative eigenvalue is strictly copositive or not can be formulated as a combination of two convex quadratic programming problems which can be solved efficiently.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Indefinite copositive matrices with exactly one positive eigenvalue or exactly one negative eigenvalue

Checking copositivity of a matrix is a co-NP-complete problem. This paper studies copositive matrices with certain spectral properties. It shows that an indefinite matrix with exactly one positive eigenvalue is copositive if and only if the matrix is nonnegative. Moreover, it shows that finding out if a matrix with exactly one negative eigenvalue is strictly copositive or not can be formulated ...

متن کامل

Ela on Symmetric Matrices with Exactly One Positive Eigenvalue

Abstract. We present a class of nonsingular matrices, the MC-matrices, and prove that the class of symmetric MC-matrices introduced by Shen, Huang and Jing [On inclusion and exclusion intervals for the real eigenvalues of real matrices. SIAM J. Matrix Anal. Appl., 31:816-830, 2009] and the class of symmetric MC-matrices are both subsets of the class of symmetric matrices with exactly one positi...

متن کامل

Eigenvalue analysis of constrained minimization problem for homogeneous polynomial

In this paper, the concepts of Pareto H -eigenvalue and Pareto Z -eigenvalue are introduced for studying constrained minimization problem and the necessary and sufficient conditions of such eigenvalues are given. It is proved that a symmetric tensor has at least one Pareto H -eigenvalue (Pareto Z -eigenvalue). Furthermore, theminimumPareto H -eigenvalue (or Pareto Z -eigenvalue) of a symmetric ...

متن کامل

Ela on 3-colored Digraphs with Exactly One Nonsingular Cycle

The class of connected 3-colored digraphs containing exactly one nonsingular cycle is considered in this article. The main objective is to study the smallest Laplacian eigenvalue and the corresponding eigenvectors of such graphs. It is shown that the smallest Laplacian eigenvalue of such a graph can be realized as the algebraic connectivity (second smallest Laplacian eigenvalue) of a suitable u...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013